Efficient deconvolution methods for astronomical imaging: algorithms and IDL-GPU codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Provably Efficient GPU Algorithms

In this paper we present an abstract model for algorithm design on GPUs by extending the parallel external memory (PEM) model with computations in internal memory (commonly known as shared memory in GPU literature) defined in the presence of memory banks and bank conflicts. We also present a framework for designing bank conflict free algorithms on GPUs. Using our framework we develop the first ...

متن کامل

GPU-Based Elasticity Imaging Algorithms

Quasi-static elastography involves estimating the displacement field of the tissue undergoing slow compression. Since elastography is computationally expensive, many compromises have been made to perform it in real time. Parallelized algorithms and implementations for freehand palpation elastography are proposed in this paper to speed the computation. We present parallel implementations for Nor...

متن کامل

An Efficient Lucky Imaging System for Astronomical Image Restoration

The resolution of astronomical imaging from large optical telescopes is usually limited by the blurring effects of refractive index fluctuations in the Earth’s atmosphere. In this paper, we develop a lucky imaging system to restore astronomical images through atmosphere turbulence on 1.23m telescope. Our system takes very short exposures, on the order of the atmospheric coherence time. The rapi...

متن کامل

Maximum subarray algorithms for use in astronomical imaging

The maximum subarray problem is used to identify the subarray of a two dimensional array, where the sum of elements is maximized. In terms of image processing, the solution has been used to find the brightest region within an image. Two parallel algorithms of the maximum subarray problem solve this problem in O(n) and O(log n) time. A field programmable gate array implementation has verified th...

متن کامل

Efficient Relational Algebra Algorithms and Data Structures for GPU

Relational databases remain an important application domain for organizing and analyzing the massive volume of data generated as sensor technology, retail and inventory transactions, social media, computer vision, and new fields continue to evolve. At the same time, processor architectures are beginning to shift towards hierarchical and parallel architectures employing throughput-optimized memo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Astronomy & Astrophysics

سال: 2012

ISSN: 0004-6361,1432-0746

DOI: 10.1051/0004-6361/201118681